QPLIB: a library of quadratic programming instances
نویسندگان
چکیده
منابع مشابه
QPLIB: A Library of Quadratic Programming Instances
This paper describes a new instance library for Quadratic Programming (QP), i.e., the family of continuous and (mixed)-integer optimization problems where the objective function, the constrains, or both are quadratic. QP is a very “varied” class of problems, comprising sub-classes of problems ranging from trivial to undecidable. Solution methods for QP are very diverse, ranging from entirely co...
متن کاملA new library of structured semidefinite programming instances
Interior point solvers for semidefinite programming (SDP) have evolved a great deal in the last decade, and their development continues. In order to further support and encourage this development, we present a new test set of SDP instances. These instances arise from recent applications of SDP in coding theory, computational geometry, graph theory and truss topology design. Most of these instan...
متن کاملQuadratic bi-level programming problems: a fuzzy goal programming approach
This paper presents a fuzzy goal programming (FGP) methodology for solving bi-level quadratic programming (BLQP) problems. In the FGP model formulation, firstly the objectives are transformed into fuzzy goals (membership functions) by means of assigning an aspiration level to each of them, and suitable membership function is defined for each objectives, and also the membership functions for vec...
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملquadratic bi-level programming problems: a fuzzy goal programming approach
this paper presents a fuzzy goal programming (fgp) methodology for solving bi-level quadratic programming (blqp) problems. in the fgp model formulation, firstly the objectives are transformed into fuzzy goals (membership functions) by means of assigning an aspiration level to each of them, and suitable membership function is defined for each objectives, and also the membership functions for vec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming Computation
سال: 2018
ISSN: 1867-2949,1867-2957
DOI: 10.1007/s12532-018-0147-4